Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks
نویسندگان
چکیده
Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print or online or to submit the papers to another publication.
منابع مشابه
Analytical approximation of transient joint queue-length distributions within finite capacity Markovian queueing networks
This paper presents an analytical approximate and computationally tractable technique for the transient analysis of finite capacity Markovian networks. The approach is based on a network decomposition that is unique, it decomposes the network into overlapping (non-disjoint) subnetworks. The model approximates the transient queue-length distributions of the subnetworks. It is computationally tra...
متن کاملA Queueing Model of General Servers in Tandem with Finite Buffer Capacities
We consider a queueing model with finite capacities. External arrivals follow a Coxian distribution. Due to the limitation of the capacity, arrivals may be lost if the buffer is full. Our goal is to study the probability of blocking. In order to obtain the steady-state probability distribution of this model, we construct an embedded Markov chain at the departure points. The solution is solved ...
متن کاملMQNA - Markovian Queueing Networks Analyser
This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic ...
متن کاملClosed queueing networks with finite capacity queues: approximate analysis
Queueing networks with finite capacity queues and blocking are applied to model systems with finite resources and population constraints, such as computer and communication systems, as well as traffic, production and manufacturing systems. Various blocking types can be defined to represent different system behaviors. When a customer attempts to enter a full capacity queue blocking occurs. The a...
متن کاملA tractable analytical model for large-scale congested protein synthesis networks
This paper presents an analytical model, based on finite capacity queueing network theory, to evaluate congestion in protein synthesis networks. These networks are modeled as a set of single server bufferless queues in a tandem topology. This model proposes a detailed state space formulation, which provides a fine description of congestion and contributes to a better understanding of how the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Transportation Science
دوره 51 شماره
صفحات -
تاریخ انتشار 2017